Optimal Rank - Based Tests for Sphericity

نویسندگان

  • Marc Hallin
  • Davy Paindaveine
  • D. PAINDAVEINE
چکیده

We propose a class of rank-based procedures for testing that the shape matrix V of an elliptical distribution (with unspecified center of symmetry, scale, and radial density) has some fixed value V0; this includes, for V0 = Ik, the problem of testing for sphericity as an important particular case. The proposed tests are invariant under translations, monotone radial transformations, rotations, and reflections with respect to the estimated center of symmetry. They are valid without any moment assumption. For adequately chosen scores, they are locally asymptotically maximin (in the Le Cam sense) at given radial densities. They are strictly distribution-free when the center of symmetry is specified, and asymptotically so, when it has to be estimated. The multivariate ranks used throughout are those of the distances—in the metric associated with the null value V0 of the shape matrix—between the observations and the (estimated) center of the distribution. Local powers (against elliptical alternatives) and asymptotic relative efficiencies (AREs) are derived with respect to the adjusted Mauchly test (a modified version proposed by Muirhead and Waternaux (1980) of the Gaussian likelihood ratio procedure) or, equivalently, with respect to (an extension of) John (1971)’s test for sphericity. For Gaussian scores, these AREs are uniformly larger than one, irrespective of actual underlying radial densities. Necessary and/or sufficient conditions for consistency under nonlocal, possibly non-elliptical alternatives, are given. Small sample performances are investigated via a Monte-Carlo study.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semiparametrically Efficient Rank-based Inference for Shape I. Optimal Rank-based Tests for Sphericity

We propose a class of rank-based procedures for testing that the shape matrix V of an elliptical distribution (with unspecified center of symmetry, scale, and radial density) has some fixed value V0; this includes, for V0 = Ik, the problem of testing for sphericity as an important particular case. The proposed tests are invariant under translations, monotone radial transformations, rotations, a...

متن کامل

Multivariate nonparametrical methods based on spatial signs and ranks: The R package SpatialNP

Classical multivariate statistical inference methods are often based on the sample mean vector and covariance matrix. They are then optimal under the assumption of multivariate normality but loose in efficiency in the case of heavy tailed distribution. In this paper nonparametric and robust competitors based on the spatial signs and ranks are discussed and the R statistical software package to ...

متن کامل

Linear Sphericity Testing of 3-Connected Single Source Digraphs

It has been proved that sphericity testing for digraphs is an NP-complete problem. Here, we investigate sphericity of 3-connected single source digraphs. We provide a new combinatorial characterization of sphericity and give a linear time algorithm for sphericity testing. Our algorithm tests whether a 3-connected single source digraph with $n$ vertices is spherical in $O(n)$ time.

متن کامل

A Class of Simple Distribution-Free Rank-Based Unit Root Tests

We propose a class of distribution-free rank-based tests for the null hypothesis of a unit root. This class is indexed by the choice of a reference density g, which needs not coincide with the unknown actual innovation density f . The validity of these tests, in terms of exact finite sample size, is guaranteed, irrespective of the actual underlying density, by distribution-freeness. Those tests...

متن کامل

Linear Sphericity Testing of 3-connected Single Source Digraphs

It has been proved that sphericity testing for digraphs is an NP-complete problem. Here, we investigate sphericity of 3connected single source digraphs. We provide a new combinatorial characterization of sphericity and give a linear time algorithm for sphericity testing. Our algorithm tests whether a 3-connected single source digraph with n vertices is spherical in O(n) time.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005